0.07/0.08 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 240 THM 0.08/0.27 % Computer : n003.cluster.edu 0.08/0.27 % Model : x86_64 x86_64 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.08/0.27 % Memory : 8042.1875MB 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64 0.08/0.27 % CPULimit : 1920 0.08/0.27 % WCLimit : 240 0.08/0.27 % DateTime : Wed Jul 30 03:53:19 EDT 2025 0.08/0.27 % CPUTime : 0.13/0.38 Running higher-order theorem proving 0.13/0.38 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox/tmp/tmp.eJ6hi5xzOX/E---3.1_21234.p 0.13/0.39 # Version: 3.0.0-ho 0.13/0.39 # Preprocessing class: HSSSSMSSSSSNSSA. 0.13/0.39 # Scheduled 8 strats onto 8 cores with 240 seconds (1920 total) 0.13/0.39 # Starting post_as_ho12 with 240s (1) cores 0.13/0.39 # Starting new_bool_9 with 240s (1) cores 0.13/0.39 # Starting post_as_ho1 with 240s (1) cores 0.13/0.39 # Starting post_as_ho4 with 240s (1) cores 0.13/0.39 # Starting post_as_ho2 with 240s (1) cores 0.13/0.39 # Starting ehoh_best2_full_lfho with 240s (1) cores 0.13/0.39 # Starting full_lambda_10 with 240s (1) cores 0.13/0.39 # Starting new_ho_8 with 240s (1) cores 0.13/0.39 # post_as_ho12 with pid 21312 completed with status 0 0.13/0.39 # Result found by post_as_ho12 0.13/0.39 # Preprocessing class: HSSSSMSSSSSNSSA. 0.13/0.39 # Scheduled 8 strats onto 8 cores with 240 seconds (1920 total) 0.13/0.39 # Starting post_as_ho12 with 240s (1) cores 0.13/0.39 # No SInE strategy applied 0.13/0.39 # Search class: HUUPF-FFSF11-SSSFFMBN 0.13/0.39 # partial match(1): HUUPF-FFSF11-SSSFFMNN 0.13/0.39 # Scheduled 5 strats onto 1 cores with 240 seconds (240 total) 0.13/0.39 # Starting post_as_ho12 with 145s (1) cores 0.13/0.39 # post_as_ho12 with pid 21320 completed with status 0 0.13/0.39 # Result found by post_as_ho12 0.13/0.39 # Preprocessing class: HSSSSMSSSSSNSSA. 0.13/0.39 # Scheduled 8 strats onto 8 cores with 240 seconds (1920 total) 0.13/0.39 # Starting post_as_ho12 with 240s (1) cores 0.13/0.39 # No SInE strategy applied 0.13/0.39 # Search class: HUUPF-FFSF11-SSSFFMBN 0.13/0.39 # partial match(1): HUUPF-FFSF11-SSSFFMNN 0.13/0.39 # Scheduled 5 strats onto 1 cores with 240 seconds (240 total) 0.13/0.39 # Starting post_as_ho12 with 145s (1) cores 0.13/0.39 # Preprocessing time : 0.001 s 0.13/0.39 # Presaturation interreduction done 0.13/0.39 0.13/0.39 # Proof found! 0.13/0.39 # SZS status Theorem 0.13/0.39 # SZS output start CNFRefutation 0.13/0.39 thf(decl_23, type, esk1_1: ($i > $i > $o) > $i). 0.13/0.39 thf(decl_24, type, esk2_1: ($i > $i > $o) > $i). 0.13/0.39 thf(cTHM3_pme, conjecture, ?[X1:$i > $i > $o]:(![X2:$i, X3:$i]:((((X2)=(X3))<=((X1 @ X2)=(X1 @ X3))))), file('/export/starexec/sandbox/tmp/tmp.eJ6hi5xzOX/E---3.1_21234.p', cTHM3_pme)). 0.13/0.39 thf(c_0_1, negated_conjecture, ~(?[X1:$i > $i > $o]:(![X2:$i, X3:$i]:((((X1 @ X2)=(X1 @ X3))=>((X2)=(X3)))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM3_pme])])). 0.13/0.39 thf(c_0_2, negated_conjecture, ![X7:$i > $i > $o]:((((X7 @ (esk1_1 @ X7))=(X7 @ (esk2_1 @ X7)))&((esk1_1 @ X7)!=(esk2_1 @ X7)))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])). 0.13/0.39 thf(c_0_3, negated_conjecture, ![X1:$i > $i > $o]:(((X1 @ (esk1_1 @ X1))=(X1 @ (esk2_1 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.13/0.39 thf(c_0_4, negated_conjecture, ![X1:$i > $i > $o, X10:$i]:(((X1 @ (esk2_1 @ X1) @ X10)<=>(X1 @ (esk1_1 @ X1) @ X10))), inference(arg_cong,[status(thm)],[c_0_3])). 0.13/0.39 thf(c_0_5, negated_conjecture, ![X1:$i > $i > $o, X2:$i]:(((X1 @ (esk2_1 @ X1) @ X2)|~((X1 @ (esk1_1 @ X1) @ X2)))), inference(dynamic_cnf,[status(thm)],[c_0_4])). 0.13/0.39 thf(c_0_6, negated_conjecture, ![X18:$i > $i > $i, X17:$i > $i > $i, X2:$i]:((((X17 @ (esk2_1 @ (^[Z0/* 19 */:$i, Z1:$i]:(((X17 @ Z0 @ Z1)=(X18 @ Z0 @ Z1))))) @ X2)=(X18 @ (esk2_1 @ (^[Z0/* 19 */:$i, Z1:$i]:(((X17 @ Z0 @ Z1)=(X18 @ Z0 @ Z1))))) @ X2))|((X17 @ (esk1_1 @ (^[Z0/* 19 */:$i, Z1:$i]:(((X17 @ Z0 @ Z1)=(X18 @ Z0 @ Z1))))) @ X2)!=(X18 @ (esk1_1 @ (^[Z0/* 19 */:$i, Z1:$i]:(((X17 @ Z0 @ Z1)=(X18 @ Z0 @ Z1))))) @ X2)))), inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]), c_0_5])). 0.13/0.39 thf(c_0_7, negated_conjecture, ![X1:$i > $i > $o]:(((esk1_1 @ X1)!=(esk2_1 @ X1))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.13/0.39 thf(c_0_8, negated_conjecture, ((esk2_1 @ $eq)=(esk1_1 @ $eq)), inference(er,[status(thm)],[c_0_6])). 0.13/0.39 thf(c_0_9, negated_conjecture, ($false), inference(spm,[status(thm)],[c_0_7, c_0_8]), ['proof']). 0.13/0.39 # SZS output end CNFRefutation 0.13/0.39 # Parsed axioms : 1 0.13/0.39 # Removed by relevancy pruning/SinE : 0 0.13/0.39 # Initial clauses : 2 0.13/0.39 # Removed in clause preprocessing : 0 0.13/0.39 # Initial clauses in saturation : 2 0.13/0.39 # Processed clauses : 9 0.13/0.39 # ...of these trivial : 0 0.13/0.39 # ...subsumed : 0 0.13/0.39 # ...remaining for further processing : 9 0.13/0.39 # Other redundant clauses eliminated : 0 0.13/0.39 # Clauses deleted for lack of memory : 0 0.13/0.39 # Backward-subsumed : 0 0.13/0.39 # Backward-rewritten : 0 0.13/0.39 # Generated clauses : 19 0.13/0.39 # ...of the previous two non-redundant : 9 0.13/0.39 # ...aggressively subsumed : 0 0.13/0.39 # Contextual simplify-reflections : 0 0.13/0.39 # Paramodulations : 4 0.13/0.39 # Factorizations : 0 0.13/0.39 # NegExts : 0 0.13/0.39 # Equation resolutions : 6 0.13/0.39 # Disequality decompositions : 0 0.13/0.39 # Total rewrite steps : 6 0.13/0.39 # ...of those cached : 5 0.13/0.39 # Propositional unsat checks : 0 0.13/0.39 # Propositional check models : 0 0.13/0.39 # Propositional check unsatisfiable : 0 0.13/0.39 # Propositional clauses : 0 0.13/0.39 # Propositional clauses after purity: 0 0.13/0.39 # Propositional unsat core size : 0 0.13/0.39 # Propositional preprocessing time : 0.000 0.13/0.39 # Propositional encoding time : 0.000 0.13/0.39 # Propositional solver time : 0.000 0.13/0.39 # Success case prop preproc time : 0.000 0.13/0.39 # Success case prop encoding time : 0.000 0.13/0.39 # Success case prop solver time : 0.000 0.13/0.39 # Current number of processed clauses : 6 0.13/0.39 # Positive orientable unit clauses : 1 0.13/0.39 # Positive unorientable unit clauses: 1 0.13/0.39 # Negative unit clauses : 1 0.13/0.39 # Non-unit-clauses : 3 0.13/0.39 # Current number of unprocessed clauses: 2 0.13/0.39 # ...number of literals in the above : 3 0.13/0.39 # Current number of archived formulas : 0 0.13/0.39 # Current number of archived clauses : 3 0.13/0.39 # Clause-clause subsumption calls (NU) : 0 0.13/0.39 # Rec. Clause-clause subsumption calls : 0 0.13/0.39 # Non-unit clause-clause subsumptions : 0 0.13/0.39 # Unit Clause-clause subsumption calls : 0 0.13/0.39 # Rewrite failures with RHS unbound : 0 0.13/0.39 # BW rewrite match attempts : 8 0.13/0.39 # BW rewrite match successes : 0 0.13/0.39 # Condensation attempts : 0 0.13/0.39 # Condensation successes : 0 0.13/0.39 # Termbank termtop insertions : 1058 0.13/0.39 # Search garbage collected termcells : 43 0.13/0.39 0.13/0.39 # ------------------------------------------------- 0.13/0.39 # User time : 0.004 s 0.13/0.39 # System time : 0.000 s 0.13/0.39 # Total time : 0.004 s 0.13/0.39 # Maximum resident set size: 1608 pages 0.13/0.39 0.13/0.39 # ------------------------------------------------- 0.13/0.39 # User time : 0.004 s 0.13/0.39 # System time : 0.002 s 0.13/0.39 # Total time : 0.007 s 0.13/0.39 # Maximum resident set size: 1704 pages 0.13/0.39 % E exiting 0.13/0.39 % E exiting 0.13/0.39 EOF